package DP;

/**
 * @author 曹见朋
 * @create 2024-06-16-21:51
 */
public class Main1035 {
    // TODO 1035. 不相交的线
    public static int maxUncrossedLines(int[] nums1, int[] nums2) {
        int n1 = nums1.length;
        int n2 = nums2.length;
        int[][] dp = new int[n1 + 1][n2 + 1];

        int result = 0;

        for(int i = 1; i <= n1; i++){
            for(int j = 1; j <= n2; j++){
                if(nums1[i-1] == nums2[j - 1]){
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                }else{
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }

        return dp[n1][n2];
    }

    public static void main(String[] args) {
        int[] nums1 = new int[]{2,5,1,2,5};
        int[] nums2 = new int[]{10,5,2,1,5,2};
        System.out.println(maxUncrossedLines(nums1, nums2));
    }
}
